Knapsack problem - PDFSEARCH.IO - Document Search Engine

Knapsack problem
Results: 111

#	Item
11	CS364B: Frontiers in Mechanism Design Lecture #8: MIR and MIDR Mechanisms∗ Tim Roughgarden† January 29, Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-02-19 21:14:11 Mechanism design Computational complexity theory Game theory Decision theory VickreyClarkeGroves auction VickreyClarkeGroves mechanism Incentive compatibility Knapsack problem Randomized rounding Time complexity Random-sampling mechanism Bayesian-optimal mechanism
12	Introduction to Algorithms Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis May 19, Spring 2011 Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2011-05-20 09:43:49 Computational complexity theory Mathematics Theory of computation Analysis of algorithms Operations research Asymptotic analysis Combinatorial optimization Dynamic programming Master theorem Big O notation Knapsack problem Time complexity
13	Public Key Cryptography Public Key Cryptography • Symmetric Key: – Same key used for encryption and decrypiton – Same key used for message integrity and validation Add to Reading List Source URL: bioinfo.ict.ac.cn Language: English - Date: 2014-11-28 11:05:21 Cryptography Computational complexity theory Knapsack problem Cipher Public-key cryptography Encryption Symmetric-key algorithm Key P versus NP problem MerkleHellman knapsack cryptosystem RSA
14	Revenue Maximization in the Dynamic Knapsack Problem Deniz Dizdar, Alex Gershkov and Benny MoldovanuAbstract Add to Reading List Source URL: www.econ2.uni-bonn.de Language: English - Date: 2014-03-26 06:49:17 Operations research Dynamic programming Mathematics Mathematical optimization Combinatorial optimization Applied mathematics Bellman equation Control theory Knapsack problem Systems science Mechanism design
15	CS264: Homework #8 Due by midnight on Wednesday, November 19, 2014 Instructions: (1) Students taking the course pass-fail should complete the exercises. Students taking the course for a letter grade should also complete Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-11-14 09:53:16 Computational complexity theory Operations research Theory of computation Mathematics Knapsack problem Optimization problem NP Mathematical optimization Polynomial-time approximation scheme Dynamic programming Time complexity Isolation lemma
16	May 19, Spring 2011 Final Exam Introduction to Algorithms Massachusetts Institute of Technology Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2011-05-20 09:47:26 Mathematics Computational complexity theory Mathematical analysis Analysis of algorithms Operations research Mathematical notation Asymptotic analysis Dynamic programming Big O notation Time complexity Recurrence relation Knapsack problem
17	arXiv:1511.07147v1 [cs.LG] 23 NovA PAC Approach to Application-Specific Algorithm Selection∗ Rishi Gupta Tim Roughgarden Add to Reading List Source URL: arxiv.org Language: English - Date: 2015-11-23 20:51:24 Mathematics Computational complexity theory Applied mathematics NP-complete problems Combinatorial optimization Operations research Mathematical optimization Machine learning Algorithm Greedy algorithm Heuristic Knapsack problem
18	CS264: Beyond Worst-Case Analysis Lecture #15: Smoothed Complexity and Pseudopolynomial-Time Algorithms∗ Tim Roughgarden† November 5, 2014 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-12-24 22:57:16 Computational complexity theory Theory of computation Operations research Complexity classes Combinatorial optimization Analysis of algorithms Knapsack problem Simplex algorithm Time complexity Optimization problem NP Polynomial-time approximation scheme
19	Competitive Multi-Dimensional Dynamic Bin Packing via L-Shape Bin Packing ⋆ Prudence W.H. Wong and Fencol C.C. Yung Add to Reading List Source URL: cgi.csc.liv.ac.uk Language: English - Date: 2009-10-29 07:57:39 Packing problems Bin packing problem Bin Stack Knapsack problem
20	Scheduling Black-box Mutational Fuzzing Maverick Woo Sang Kil Cha Samantha Gottlieb Add to Reading List Source URL: users.ece.cmu.edu Language: English - Date: 2014-05-29 15:38:01 Software testing Theoretical computer science Fuzz testing Algorithm Software bug Randomized algorithm Online algorithm Knapsack problem American fuzzy lop